Orthogonal Reduction on Vector Computers
نویسندگان
چکیده
This paper concerns the implementation of the QR factorization by Givens and Householder transformations on vector computers . Following the analysis of Dongarra, et al. [1984] for Gaussian elimination, various ijk forms for both Givens and Householder transformations are investigated. Conclusions concerning which of these forms have desirable or undesirable properties for vector computers are presented.
منابع مشابه
A PARALLEL ALGORITHM FOR THE REDUCTION TO TRIDIAGONAL FORM FOR EIGENDECOMPOSITIONy
A new algorithm for the orthogonal reduction of a symmetric matrix to tridiagonal form is developed and analysed. It uses a Cholesky factorization of the original matrix and the rotations are applied to the factors. The idea is similar to the one used for the one-sided Jacobi algorithms B. The algorithm uses little communication , accesses data with stride one and is to a large extent independe...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملOrthogonal support vector machine for credit scoring
The most commonly used techniques for credit scoring is logistic regression, and more recent research has proposed that the support vector machine is a more effective method. However, both logistic regression and support vector machine suffers from curse of dimension. In this paper, we introduce a new way to address this problem which is defined as orthogonal dimension reduction. We discuss the...
متن کاملTime-domain noise reduction based on an orthogonal decomposition for desired signal extraction.
This paper addresses the problem of noise reduction in the time domain where the clean speech sample at every time instant is estimated by filtering a vector of the noisy speech signal. Such a clean speech estimate consists of both the filtered speech and residual noise (filtered noise) as the noisy vector is the sum of the clean speech and noise vectors. Traditionally, the filtered speech is t...
متن کاملFundamental limits to quantum computation: the energy cost of precise quantum logic
The first motivation for thinking about quantum computers may go back to Feynman [1], who, in 1982, remarked on the intrinsic difficulties of simulating the physics of quantum systems on classical computers, and suggested that what one would need for this purpose would be quantum computers. The difficulty with classical computers that Feynman pointed out can be simply explained as follows. An a...
متن کامل